Maxclique and unit disk characterizations of strongly chordal graphs
نویسندگان
چکیده
منابع مشابه
Maxclique and unit disk characterizations of strongly chordal graphs
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly...
متن کاملStrongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and...
متن کاملStrongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...
متن کاملA characterization of strongly chordal graphs
Elias Dahlhaus Paul D. Manuel y Mirka Miller y Abstract In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle.
متن کاملMinimal vertex separators and new characterizations for dually chordal graphs
Many works related to dually chordal graphs, their cliques and neighborhoods were published. We will undertake a similar study but by considering minimal separators and their properties. Moreover we find new characterizations of dually chordal graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2014
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1757